Wpm P-3.11 a Fast Finite Field Multiplier Architecture for High-security Cryptographic Applications
نویسندگان
چکیده
A s ail iiidispeiisable p a i ~ uf'iiioderii coiisiiiiicr electi.otiics, security applicatioiis sirch us siiiart carrls arid iietwork securities play an iiiiportaiit role. 111 ,fiact. datu secirrity gets ever iiicreasiiig utteiitioii as people teiid to coiiiiiiiiiiicate with each other h). i.nrioirs electroiiic devices oi'ei' iietwork. Iii this paper. (I iicbt' uppi~oacli oii riesigiiiiig a fiiiite ,field iii~rltipliei~ aidiitectiri~e is pi.oposetl. The p i~posed architectirre ti.adrs r~etl~rctioii i tire iitiiiihei. of clock cj.cles with ~ ~ S O I I I T ~ S . This urcliitectiri.~~,f;'~ttires IiigIi peijoriiinr~ce, siiiiple sti~irctiri~e, sccrlahilit,l~ uiiil iridepeiideiice oii the choice of /lie ,fTiiite field 10 provide iiia.riiiiLiiii secirrih, to tipplicutioiis so that i t caii be applied to iurioirs fields of' srciri~i~~-deiriaiidiiig coiis~riiier electroiiic upplicutioiis.
منابع مشابه
A Novel and Efficient Hardware Implementation of Scalar Point Multiplier
A new and highly efficient architecture for elliptic curve scalar point multiplication is presented. To achieve the maximum architectural and timing improvements we have reorganized and reordered the critical path of the Lopez-Dahab scalar point multiplication architecture such that logic structures are implemented in parallel and operations in the critical path are diverted to noncritical path...
متن کاملAn Efficient Elliptic Curve Scalar Multiplication using Karatsuba Multiplier
In this era, network security is becoming a great concern .Cryptography offers high security for communication and networking. Elliptic Curve Cryptography is gaining attraction with their high level of security with low cost, small key size and smaller hardware realization. Elliptic curve scalar multiplication is the most important operation in elliptic curve cryptosystems This paper develops a...
متن کاملFast VLSI arithmetic algorithms for high-security elliptic curve cryptographic applications
In this papec we pi-opose new methods for calctrlating fast VLSl arithmetic algorithms for secure data encryption and decryption in the Elliptic Curve Ctyptosystem (ECC), and also verrfji the proofofconcepts by numerical expressions and through the use of HDL (Hardware Description Language). Ne have developed a fast finite field multiplier that utilizes a new concept, and afinite field divider ...
متن کاملDual-Field Multiplier Architecture for Cryptographic Applications
The multiplication operation in finite fields GF (p) and GF (2) is the most often used and timeconsuming operation in the harware and software realizations of public-key cryptographic systems, particularly elliptic curve cryptography. We propose a new hardware architecture for fast and efficient execution of the multiplication operation in this paper. The proposed architecture is scalable, i.e....
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کامل